Comparison Between Zagreb Eccentricity Indices and the Eccentric Connectivity Index, the Second Geometric-arithmetic Index and the Graovac-Ghorbani Index

نویسنده

  • Kinkar Ch. Das
چکیده

The concept of Zagreb eccentricity indices ( 1 E and 2 E ) was introduced in the chemical graph theory very recently. The eccentric connectivity index ( ) c ξ is a distance-based molecular structure descriptor that was used for mathematical modeling of biological activities of diverse nature. The second geometric-arithmetic index 2 ( ) GA was introduced in 2010, is found to be useful tool in QSPR and QSAR studies. In 2010 Graovac and Ghorbani introduced a distance-based analog of the atom-bond connectivity index, the Graovac-Ghorbani index ( ) GG ABC , which yielded promising results when compared to analogous descriptors. In this note we prove that  1( ) ( ) c E T ξ T for chemical trees T. For connected graph G of order n with maximum degree Δ , it is proved that  2 ( ) ( ) c ξ G E G if   Δ 1 n and  2 ( ) ( ) c ξ G E G , otherwise. Moreover, we show that  2 GG GA ABC for paths and some class of bipartite graphs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some topological indices of graphs and some inequalities

Let G be a graph. In this paper, we study the eccentric connectivity index, the new version of the second Zagreb index and the forth geometric–arithmetic index.. The basic properties of these novel graph descriptors and some inequalities for them are established.

متن کامل

Some Results on Forgotten Topological Coindex

The forgotten topological coindex (also called Lanzhou index) is defined for a simple connected graph G as the sum of the terms du2+dv2 over all non-adjacent vertex pairs uv of G, where du denotes the degree of the vertex u in G. In this paper, we present some inequalit...

متن کامل

Eccentricity Sequence and the Eccentric Connectivity Index of Two Special Categories of Fullerenes

In this paper, we calculate the eccentric connectivity index and the eccentricity sequence of two infinite classes of fullerenes with 50 + 10k and 60 + 12k (k in N) carbon atoms.

متن کامل

Eccentric Connectivity Index of Some Dendrimer Graphs

The eccentricity connectivity index of a molecular graph G is defined as (G) = aV(G) deg(a)ε(a), where ε(a) is defined as the length of a maximal path connecting a to other vertices of G and deg(a) is degree of vertex a. Here, we compute this topological index for some infinite classes of dendrimer graphs.

متن کامل

Relationship between augmented eccentric connectivity index and some other graph invariants

The augmented eccentric connectivity index of a graph which is a generalization of eccentric connectivity index is defined as the summation of the quotients of the product of adjacent vertex degrees and eccentricity of the concerned vertex of a graph. In this paper we established some relationships between augmented eccentric connectivity index and several other graph invariants like number of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016